Graph partitions with minimum degree constraints
نویسندگان
چکیده
منابع مشابه
Graph Partitions with Minimum
Given a graph with n nodes and minimum degree , we give a polynomial time algorithm that constructs a partition of the nodes of the graph into two sets X and Y such that the sum of the minimum degrees in X and in Y is at least and the cardinalities of X and Y diier by at most (+ 1 if n 6 = (mod2)). The existence of such a partition was shown by 4].
متن کاملPartitions of graphs with high minimum degree or connectivity
We prove that there exists a function f ðcÞ such that the vertex set of every f ðcÞ-connected graph G can be partitioned into sets S and T such that each vertex in S has at least c neighbours in T and both G1⁄2S and G1⁄2T are c-connected. This implies that there exists a function gðc;HÞ such that every gðc;HÞ-connected graph contains a subdivision TH of H so that G VðTHÞ is c-connected. We also...
متن کاملGraph Minors and Minimum Degree
Let Dk be the class of graphs for which every minor has minimum degree at most k. Then Dk is closed under taking minors. By the Robertson-Seymour graph minor theorem, Dk is characterised by a finite family of minor-minimal forbidden graphs, which we denote by D̂k. This paper discusses D̂k and related topics. We obtain four main results: 1. We prove that every (k + 1)-regular graph with less than ...
متن کاملGraph Partition Problems with Minimum Size Constraints
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x
متن کاملMinimum degree condition forcing complete graph immersion
An immersion of a graph H into a graph G is a one-to-one mapping f : V (H) → V (G) and a collection of edge-disjoint paths in G, one for each edge of H , such that the path Puv corresponding to edge uv has endpoints f(u) and f(v). The immersion is strong if the paths Puv are internally disjoint from f(V (H)). It is proved that for every positive integer t, every simple graph of minimum degree a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00114-9